Inhomogeneous random graphs, isolated vertices, and Poisson approximation
نویسندگان
چکیده
منابع مشابه
DISTINGUISHING VERTICES OF INHOMOGENEOUS RANDOM GRAPHS By
We explore under what conditions simple combinatorial attributes and algorithms such as the distance sequence and degree-based partitioning and refinement can be used to distinguish vertices of inhomogeneous random graphs. In the classical setting of Erdős-Renyi graphs and random regular graphs it has been proven that vertices can be distinguished in a constant number of rounds of degree-based ...
متن کاملOn the Isolated Vertices and Connectivity in Random Intersection Graphs
We study isolated vertices and connectivity in the random intersection graphG n,m, p . A Poisson convergence for the number of isolated vertices is determined at the threshold for absence of isolated vertices, which is equivalent to the threshold for connectivity. When m n and α > 6, we give the asymptotic probability of connectivity at the threshold for connectivity. Analogous results are well...
متن کاملInhomogeneous Random Graphs
The ‘classical’ random graphs, introduced by Erdős and Rényi half a century ago, are homogeneous in the sense that all their vertices play the same role and the degrees of the vertices tend to be concentrated around a typical value. Many graphs arising in the real world do not have this property, having, for example, power-law degree distributions. Thus there has been much recent interest in de...
متن کاملGeometric Inhomogeneous Random Graphs
For the theoretical study of real-world networks, we propose a model of scale-free randomgraphs with underlying geometry that we call geometric inhomogeneous random graphs (GIRGs).GIRGs generalize hyperbolic random graphs, which are a popular model to test algorithms forsocial and technological networks. Our generalization overcomes some limitations of hyperbolicrandom graphs, w...
متن کاملSusceptibility in Inhomogeneous Random Graphs
We study the susceptibility, i.e., the mean size of the component containing a random vertex, in a general model of inhomogeneous random graphs. This is one of the fundamental quantities associated to (percolation) phase transitions; in practice one of its main uses is that it often gives a way of determining the critical point by solving certain linear equations. Here we relate the susceptibil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2018
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2018.9